منابع مشابه
A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملCOVRATIO Statistic for Simple Circular Regression Model
ABSTARCT Few studies have considered the modeling of a linear relationship between two cir-cular variables or circular regression model. However, the problem of outlier detection in these models has not received enough consideration. This paper extends the COVRATIO statistic which is originally used to identify outliers in linear regression model. It is our aim to further exploit this approach ...
متن کاملParallel and Distributed Computing in Circular Accelerators
There are some problems of accelerator simulation (for example, computer design of new accelerator projects, optimization of working machines and quasi-real time accelerator control) which demand high performance computing using parallel and distributed computer systems. In particular, usage of computer clusters set is perspective for this purpose. In this reports we develop the approach sugges...
متن کاملComputing Conformal Maps onto Circular Domains
We show that, given a non-degenerate, finitely connected domain D, its boundary, and the number of its boundary components, it is possible to compute a conformal mapping of D onto a circular domain without prior knowledge of the circular domain. We do so by computing a suitable bound on the error in the Koebe construction (but, again, without knowing the circular domain in advance). Recent resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific American
سال: 1903
ISSN: 0036-8733
DOI: 10.1038/scientificamerican07181903-23032asupp